Robust Computer Algebra, Theorem Proving, and Oracle AI

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Computer Algebra, Theorem Proving, and Oracle AI

In the context of superintelligent AI systems, the term “oracle” has two meanings. One refers to modular systems queried for domain-specific tasks. Another usage, referring to a class of systems which may be useful for addressing the value alignment and AI control problems, is a superintelligent AI system that only answers questions. The aim of this manuscript is to survey contemporary research...

متن کامل

Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS

We describe an interface between version 6 of the Maple computer algebra system with the PVS automated theorem prover. The interface is designed to allow Maple users access to the robust and checkable proof environment of PVS. We also extend this environment by the provision of a library of proof strategies for use in real analysis. We demonstrate examples using the interface and the real analy...

متن کامل

Computer Theorem Proving and HoTT

Theorem-proving is a one-player game. The history of computer programs being the players goes back to 1956 and the ‘LT’ LOGIC THEORY MACHINE of Newell, Shaw and Simon. In game-playing terms, the ‘initial position’ is the core set of axioms chosen for the particular logic and the ‘moves’ are the rules of inference. Now, the Univalent Foundations Program at IAS Princeton and the resulting ‘HoTT’ ...

متن کامل

Computer Theorem Proving in Math

We give an overview of issues surrounding computerverified theorem proving in the standard pure-mathematical context.

متن کامل

Automated theorem proving in support of computer algebra : symbolic de niteintegration as a case studyA

We assess the current state of research in the application of computer aided formal reasoning to computer algebra, and argue that embdedded veriication support allows users to enjoy its beneets without wrestling with technicalities. We illustrate this claim by considering symbolic deenite integration , and present a veriiable symbolic deenite integral table-look up: a system which matches a que...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SSRN Electronic Journal

سال: 2017

ISSN: 1556-5068

DOI: 10.2139/ssrn.3038545